The Nonsingular Matrix Completion Problem

نویسندگان

  • Juan R. Torregrosa
  • Cristina Jordán
چکیده

An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a NS-matrix (TNS-matrix) completion. Here, we prove that any partial NS-matrix (TNS-matrix) has a NS-matrix (TNS-matrix) completion. Mathematics Subject Classification: 15A09, 15A15

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Graph Matrix Completion in Presence of Outliers

Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...

متن کامل

Matrix Completion by the Principle of Parsimony

Dempster’s covariance selection method is extended first to general nonsingular matrices and then to full rank rectangular matrices. Dempster observed that his completion solved a maximum entropy problem. We show that our generalized completions are also solutions of a suitable entropy-like variational problem.

متن کامل

The inverse of any two-by-two nonsingular partitioned matrix and three matrix inverse completion problems

A formula for the inverse of any nonsingular matrix partitioned into two-by-two blocks is derived through a decomposition of the matrix itself and generalized inverses of the submatrices in the matrix. The formula is then applied to three matrix inverse completion problems to obtain their complete solutions.

متن کامل

Computation of the q-th roots of circulant matrices

In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.

متن کامل

Symmetrised Doubly Non Central, Nonsingular Matrix Variate Beta Distribution

In this paper, we determine the symmetrised density of a nonsingular doubly noncentral matrix variate beta type I and II distributions under different definitions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006